Optimization of Schur-convex functions

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Schur-Convexity of Averages of Convex Functions

1 Department of Mathematics, Faculty of Civil Engineering, University of Zagreb, Kačićeva 26, 10000 Zagreb, Croatia 2 Faculty of Food Technology and Biotechnology, University of Zagreb, Pierottijeva 6, 10000 Zagreb, Croatia 3 Abdus Salam School of Mathematical Sciences, 68-B, New Muslim Town, Lahore 54600, Pakistan 4 Faculty of Textile Technology, University of Zagreb, Prilaz baruna Filipovića ...

متن کامل

Schur-convex Functions and Isoperimetric Inequalities

In this paper, we establish some analytic inequalities for Schurconvex functions that are made of solutions of a second order nonlinear differential equation. We apply these analytic inequalities to obtain some geometric inequalities.

متن کامل

Optimization of Convex Risk Functions

We consider optimization problems involving convex risk functions. By employing techniques of convex analysis and optimization theory in vector spaces of measurable functions we develop new representation theorems for risk models, and optimality and duality theory for problems with convex risk functions.

متن کامل

Beyond Convex Optimization: Star-Convex Functions

We introduce a polynomial time algorithm for optimizing the class of star-convex functions, under no Lipschitz or other smoothness assumptions whatsoever, and no restrictions except exponential boundedness on a region about the origin, and Lebesgue measurability. The algorithm’s performance is polynomial in the requested number of digits of accuracy and the dimension of the search domain. This ...

متن کامل

Distributed Optimization of Convex Sum of Non-Convex Functions

We present a distributed solution to optimizing a convex function composed of several nonconvex functions. Each non-convex function is privately stored with an agent while the agents communicate with neighbors to form a network. We show that coupled consensus and projected gradient descent algorithm proposed in [1] can optimize convex sum of non-convex functions under an additional assumption o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Inequalities & Applications

سال: 1998

ISSN: 1331-4343

DOI: 10.7153/mia-01-31